منابع مشابه
Fast Pseudo-Hadamard Transforms
We prove that the fast pseudo-Hadamard transform (FPHT) over a finite field has a bounded branch number. We shall demonstrate that the transform has an efficient implementation for various platforms compared to an equal dimension MDS code. We prove that when using a CS-Cipher[3] like construction the weight of any 2R trail is bounded for the case of an 8 × 8 transform. We show that the FPHT can...
متن کاملLaplace Transforms via Hadamard Factorization
Abstract. In this paper we consider the Laplace transforms of some random series, in particular, the random series derived as the squared L2 norm of a Gaussian stochastic process. Except for some special cases, closed form expressions for Laplace transforms are, in general, rarely obtained. It is the purpose of this paper to show that for many Gaussian random processes the Laplace transform can...
متن کاملHadamard transforms of three-term sequences
) ( ) ( 2 q q x x x Tr x f + + = and A = {ai} where ) ( i i f a α = . In reference [1], the sequence A is conjectured to have a two-level autocorrelation for all n > 1 and this conjecture has been verified for 23 3 ≤ ≤ n . In this note, we present an interesting formula for the Hadamard transform of the sequence A or, equivalently, for the function f(x). The Hadamard transform of f(x) is define...
متن کاملFamily of Unified Complex Hadamard Transforms
Novel discrete orthogonal transforms are introduced in this paper, namely the unified complex Hadamard transforms. These transforms have elements confined to four elementary complex integer numbers which are generated based on the Walsh–Hadamard transform, using a single unifying mathematical formula. The generation of higher dimension transformation matrices are discussed in detail.
متن کاملLapped Hadamard transforms and filter banks
In this paper, we generalize the Hadamard transform to the the case of lapped transform A matrix A(z) is a lapped Hadamard transform if it satisfies A ~ ( ~ ' ) A ( ~ ) = a~ for some integer a and all the entries of its coefficient matrices are i1. Many methods have been proposed to construct lapped Hadamard matrices. In this paper, we will study these matrices using the theory of paraunitary f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta universitatis - series: Electronics and Energetics
سال: 2007
ISSN: 0353-3670,2217-5997
DOI: 10.2298/fuee0703309s